Least Cost Routing in Inter-Carrier Context
نویسندگان
چکیده
Carriers conveying long-distance traffic face different routing options with regard to service quality and cost. Thus, Least Cost Routing (LCR) solutions supporting optimal decisions become a very important issue in the inter-carrier operations. In this paper, we present this problem in the context of the long-distance traffic partner-carrier choice. The mathematical optimization problem is formulated. Especially, constraints (e.g., capacity, volume) related to the techniques used are considered. Different tariffs formulations are taken into account as well. Then, the methods to find the optimal and sub-optimal solutions are elaborated.
منابع مشابه
A Robust Model for a Dynamic Cellular Manufacturing System with Production Planning
In this paper, a robust optimization approach is proposed to design a dynamic cellular manufacturing system (DCMS) under uncertainty of processing time of products. In addition, a mathematical model considering cell formation, inter-cell design and production planning under a dynamic environment (i.e., product mix and demand are changed in each period) is presented. Therefore, reconfiguration b...
متن کاملEvaluating the Residents’ Opinions of the Neighborhood about the Inter-productive Structures in Historical Context of Julfa, Isfahan
Isfahan’s Julfa neighborhood has been one of the valuable historical neighborhoods related to the Safavid era. It is different from other neighborhoods of the city due to the residents’ cultural-religious differences. Interventions in historical contexts are taking place with a variety of approaches around the world. The present study was conducted to answer this question: What should the inter...
متن کاملAn adaptive inter-domain PCE framework to improve resource utilization and reduce inter-domain signaling
Upcoming broadband commercial and scientific applications are now demanding high bandwidth pipes across multiple domains with guaranteed Quality of Service (QoS). Recent research initiatives such as the Path Computation Element (PCE) framework are focusing on the development of scalable multidomain QoS provisioning frameworks, especially within the emerging carrier grade transport technologies ...
متن کاملHeuristic methods for delay constrained least cost routing using κ-shortest-paths
The Delay Constrained Least Cost (DCLC) problem is to find the least cost path in a graph while keeping the path delay below a specified value. First formulated in the context of routing in computer networks, the DCLC model also applies to mission planning and other decision problems. DCLC is NP-complete and therefore many heuristic algorithms have been proposed for it. This paper presents two ...
متن کاملA Two-Phase Hybrid Heuristic Method for a Multi-Depot Inventory-Routing Problem
In this study, a two phase hybrid heuristic approach was proposed to solve the multi-depot multi-vehicle inventory routing problem (MDMVIRP). Inventory routing problem (IRP) is one of the major issues in the supply chain networks that arise in the context of vendor managed systems (VMI) The MDMVIRP combines inventory management and routing decision. We are given on input a fleet of homogeneous ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006